Coassociativity Breaking and Oriented Graphs
نویسنده
چکیده
With each coassociative coalgebra, we associate an oriented graph. The coproduct ∆, obeying the coassociativity equation (∆ ⊗ id)∆ = (id ⊗ ∆)∆ is then viewed as a physical propagator which can convey information. We notice that such a coproduct is non local. To recover locality we have to break the coassociativity of the coproduct and restore it, in some sense by introducing another coproduct ∆̃. The coassociativity equation becomes the coassociativity breaking equation (∆̃⊗id)∆ = (id⊗∆)∆̃. A coalgebra equipped with such coproducts, will be called a L-coalgebra. We prove then that any oriented graph whose paths may be equipped with a probability measure, can be seen as derived from such an algebraic formalism. The aim of this article is to study the consequences of such a physical viewpoint into the algebraic formalism, especially for a unital algebra equipped with its flower graph. We will show also the consequences of the notion of curvature of a 1-cochain introduced by Quillen in this framework and a common point with the associative product of this algebra, homomorphisms, Leibnitz derivatives and Ito derivatives. As the concept of Ito derivative appears naturally in this framework it will be studied throughout this article. In an attempt to adapt what was done in the case of cyclic cocycles to the Ito case, we construct a di-superalgebra (notions due to Quillen and Loday) from the curvature of an Ito derivative. We show also that (pre)-dialgebras are in one to one correspondence with dendriform algebras equipped with one associative product. We generalise our concept of L-coalgebras to L-coalgebras of degree n and show that M2(k) and the quaternions algebra H are (Markov) L-Hopf algebras of degree 2. We go further by introducing the notion of probabilistic algebraic product, notion which comes naturally from graph theory and coalgebra (matrix product in relation with the graph of Sl(2)q , wedge product in relation with the oriented triangle graph). 1 1991 Mathematics Subject Classification: 16A24, 60J15, 05C20
منابع مشابه
ar X iv : m at h / 02 09 10 8 v 2 [ m at h . Q A ] 1 7 Se p 20 02 Paving the 4 - De - Bruijn graph with a
This paper is the following up of our work on coassociativity breaking and oriented graphs. Firstly, we show that there exists a left-structure on Slq(2) which is also a Hopf algebra and which is entangled by the coassociativity breaking equation to the usual one. Secondly, we show that the n-De Bruijn oriented graphs, viewed as Markov co-dialgebras, can be paved by n oriented graphs, viewed as...
متن کاملar X iv : m at h / 02 09 10 8 v 1 [ m at h . Q A ] 1 0 Se p 20 02 The hidden structure of Sl q ( 2 )
In [1], we associate an oriented graph with each coalgebra and define the notion of (Markov) L-coalgebra, i.e. a k-vector space equipped with a left coproduct, ∆̃ and a right coproduct ∆, verifying the coassociativity breaking equation (∆̃⊗id)∆ = (id⊗∆)∆̃. The aim of this work is twofold. Firstly, we show that some coassociative coalgebras are closely related to Markov co-dialgebras, (i.e. Markov ...
متن کاملAn Algebraic Framework of Weighted Directed Graphs
We show that an algebraic formulation of weighted directed graphs leads to introducing a k-vector space equipped with two coproducts ∆ and˜∆ verifying the so-called coassociativity breaking equation (˜ ∆ ⊗ id)∆ = (id ⊗∆) ˜ ∆. Such a space is called an L-coalgebra. Explicit examples of such spaces are constructed and links between graph theory and coassociative coalgebras are given. 1. Introduct...
متن کاملNew skew equienergetic oriented graphs
Let $S(G^{sigma})$ be the skew-adjacency matrix of the oriented graph $G^{sigma}$, which is obtained from a simple undirected graph $G$ by assigning an orientation $sigma$ to each of its edges. The skew energy of an oriented graph $G^{sigma}$ is defined as the sum of absolute values of all eigenvalues of $S(G^{sigma})$. Two oriented graphs are said to be skew equienergetic iftheir skew energies...
متن کاملCycle-Breaking Techniques for Scheduling Synchronous Dataflow Graphs
System-level modeling, simulation, and synthesis using the synchronous dataflow (SDF) model of computation is widespread in design automation for communication and digital signal processing (DSP) systems. SDF scheduling has a large impact on the performance and memory requirements of implementations. One of the major problems in scheduling SDF graphs is that the existence of cycles in the targe...
متن کامل